例句與造句

1. On the subtrees of random binary search trees
   隨機二叉搜索樹的子樹
2. A binary search tree is a binary tree with the following properties
   二進制搜索樹( bst )是具有以下屬性的二進制樹：
3. Binary search tree
   二叉查找樹
4. Binary search trees are useful for finding items in a list that changes infrequently
   二叉搜索樹在查找經(jīng)常變化的列表時是很非常有用的。
5. Add and remove operations are typically expensive since binary search trees require that a tree be balanced
   通常需要增加和刪除操作，因為二叉樹需要被平衡。
6. It's difficult to find binary search tree in a sentence. 用binary search tree造句挺難的
7. Simple binary tree class - binary search trees are useful for finding items in a list that changes infrequently
   二叉搜索樹在查找經(jīng)常變化的列表時是很非常有用的。
8. The split of search space can be described as a virtue binary search tree and the info - search process is similar to the search in the binary tree
   在此基礎(chǔ)上，信息的搜索就可描述為二進制搜索樹的查找過程。
9. Using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem
   用一個二叉搜索樹或者將串切分成長度的平方根那么長的小段都可以解決這個問題。
10. In the above example , a simple hashmap or binary search tree could have easily solved the problem , but implementing one of these data structures in xsl would be inconvenient and unnecessary
    在上面的示例中，如果使用一個簡單的散列圖（ hashmap ）或二進制搜索樹就可以輕易地解決問題，但是用xsl實現(xiàn)一個這樣的數(shù)據(jù)結(jié)構(gòu)并不是很方便，并且是不必要的。